Formal veri cation of simulations between I / O automata
نویسندگان
چکیده
This thesis presents a tool for validating descriptions of distributed algorithms in the IOA language using an interactive theorem prover. The tool translates IOA programs into Larch Shared Language speci cations in a style which is suitable for formal reasoning. The framework supports two common strategies for establishing the correctness of distributed algorithms: Invariants and simulation relations. These strategies are used to verify three distributed data management algorithms: A strong caching algorithm, a majority voting algorithm and Lamport's replicated state machine algorithm. Thesis Supervisor: Stephen J. Garland Title: Principal Research Scientist Thesis Supervisor: Nancy A. Lynch Title: NEC Professor of Software Science and Engineering
منابع مشابه
An Object-Oriented Approach to Verifying Group Communication Systems
Group communication system assist the development of faulttolerant distributed algorithms by providing precise guarantees on message ordering, delivery, and synchronization. Ensemble is a widely used group communication system that is highly modular and con gurable. Formally verifying Ensemble is a formidable task, but it has wide-ranging bene ts, from formal assistance in the design of new dis...
متن کاملA Process Algebraic View of I / O Automata
The Input/Output Automata formalism of Lynch and Tuttle is a widely used framework for the speci cation and veri cation of concurrent algorithms. Unfortunately, it has never been provided with an algebraic characterization, a formalization which has been fundamental for the success of theories like CSP, CCS and ACP. We present a many-sorted algebra for I/O Automata that takes into account notio...
متن کاملA Proof checked Veri cation of a Real Time Communication Protocol
We present an analysis of a protocol developed by Philips to connect several com ponents of an audio system The veri cation of the protocol is carried out using the timed I O automata model of Lynch and Vaandrager The veri cation has been partially proof checked with the interactive proof construction program Coq The proof checking revealed an error in the correctness proof not in the protocol
متن کاملA verification environment for I-O-automata based on formalized meta-theory
This thesis deals with the computer-assisted veri cation of embedded systems described as Input/Output automata. We achieve contributions in two elds: the theory of untimed I/O automata and its tool support. For the latter a combination of the theorem prover Isabelle with model checking is used. Concerning the theory of I/O automata, we present a new temporal logic which considerably facilitate...
متن کامل